Meeting Times of Random Walks on Graphs
نویسندگان
چکیده
We prove an upper bound on the meeting time of an arbitrary number of random walks in any connected undirected graph in terms of the meeting times of fewer random walks. We show that the bound is tight for rings, and that it is both stronger and more general than a bound suggested by Tetali and Winkler [4].
منابع مشابه
Exact computation for meeting times and infection times of random walks on graphs
We consider independent multiple random walks on graphs and study comparison results of meeting times and infection times between many conditions of the random walks by obtaining the exact density functions or expectations.
متن کاملOn coalescence time in graphs-When is coalescing as fast as meeting?
Coalescing random walks is a fundamental stochastic process, where a set of particles perform independent discrete-time random walks on an undirected graph. Whenever two or more particles meet at a given node, they merge and continue as a single random walk. The coalescence time is defined as the expected time until only one particle remains, starting from one particle at every node. Despite re...
متن کاملOn the Meeting Time for Two Random Walks on a Regular Graph
We provide an analysis of the expected meeting time of two independent random walks on a regular graph. For 1-D circle and 2-D torus graphs, we show that the expected meeting time can be expressed as the sum of the inverse of non-zero eigenvalues of a suitably defined Laplacian matrix. We also conjecture based on empirical evidence that this result holds more generally for simple random walks o...
متن کاملMean field conditions for coalescing random walks
The main results in this paper are about the full coalescence time C of a system of coalescing random walks over a finite graph G. Letting m(G) denote the mean meeting time of two such walkers, we give sufficient conditions under which E [C] ≈ 2m(G) and C/m(G) has approximatelly the same law as in the “mean field” setting of a large complete graph. One of our theorems is that mean field behavio...
متن کاملFirst Hitting times of Simple Random Walks on Graphs with Congestion Points
We derive the explicit formulas of the probability generating functions of the first hitting times of simple random walks on graphs with congestion points using group representations. 1. Introduction. Random walk on a graph is a Markov chain whose state space is the vertex set of the graph and whose transition from a given vertex to an adjacent vertex along an edge is defined according to some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 69 شماره
صفحات -
تاریخ انتشار 1999